Identifying Cross Copora Document Associations Via Minimal Spanning Trees
نویسندگان
چکیده
This talk will focus on our recent work in the identification of related documents from different corpora or discipline areas. The purpose of this work is to help a researcher or program manager to identify fruitful cross-disciplinary research areas. The talk will discuss some preliminary results that have been obtained using a small Science News (around 1200 articles) dataset. The work is predicated on new visualization environment to facilitate the exploration of the multi-class interpoint distance matrix. This work is joint with the Algotek Team in general and Edward J. Wegman of GMU and Avory Bryant of NSWCDD specifically.
منابع مشابه
Counting and Constructing Minimal Spanning Trees
We revisit the minimal spanning tree problem in order to develop a theory of construction and counting of the minimal spanning trees in a network. The theory indicates that the construction of such trees consists of many di erent choices, all independent of each other. These results suggest a block approach to the construction of all minimal spanning trees in the network, and an algorithm to th...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملClassifier Optimization Via Graph Complexity Measures
This paper examines the use of minimal spanning trees as an alternative measure of classifier performance. The ability of this measure to capture classifier complexity is studied through the use of a gene expression dataset. The effect of distance metric on classifier performance is also detailed within.
متن کاملExtermal trees with respect to some versions of Zagreb indices via majorization
The aim of this paper is using the majorization technique to identify the classes of trees with extermal (minimal or maximal) value of some topological indices, among all trees of order n ≥ 12
متن کاملOn relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کامل